Nuprl Lemma : all-but-one 0,22

T:Type, P:(TProp), L:T List.
0<||L||
 (xy:T. Dec(x = y))
 ((xLyLx = y  T  P(x P(y))  (xL.yLx = y  T  P(y))) 
latex


DefinitionsP  Q, P & Q, P  Q, P  Q, False, (xL.P(x)), xLP(x), xt(x), A, x(s), Dec(P), P  Q, Prop, ||as||, x:AB(x), t  T, {T}, ij, (x  l), x:AB(x), {i..j}, i  j < k, AB, l[i], ij, i<j, hd(l)
Lemmasexists functionality wrt iff, le wf, select member, cons member, l member wf, all functionality wrt iff, non neg length, l all nil, false wf, iff wf, l exists nil, or functionality wrt iff, iff functionality wrt iff, implies functionality wrt iff, l all cons, and functionality wrt iff, iff transitivity, l exists cons, length wf1, decidable wf, not wf, l all wf, l exists wf

origin